PATH COVERINGS WITH PRESCRIBED ENDS OF THE n−DIMENSIONAL BINARY HYPERCUBE
نویسنده
چکیده
Let Qn be the n−dimensional binary hypercube, u1, u2 and u3 be distinct even vertices of Qn and v1, v2 and v3 be distinct odd vertices of Qn. We prove that if n ≥ 4, then there exist three paths in Qn, one joining u1 and v1, one joining u2 and u3 and one joining v2 and v3, such that every vertex ofQn belongs to exactly one of the paths.
منابع مشابه
Path Coverings with Prescribed Ends in Faulty Hypercubes
We discuss the existence of vertex disjoint path coverings with prescribed ends for the n-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer m such that for every n ≥ m such path coverings exist. Using some of these results, for k ≤ 4, we prove Locke’s conjectu...
متن کاملHamiltonian Laceability of Hypercubes with Faults of Charge One
In 2007, in their paper Path coverings with prescribed ends in faulty hypercubes, N. Castañeda and I. Gotchev formulated the following conjecture: Let n and k be positive integers with n ≥ k + 3 and F be a set of k even (odd) and k + 1 odd (even) vertices in the binary hypercube Qn. If u1 and u2 are two distinct even (odd) vertices inQn − F then forQn − F there exists a Hamiltonian path that co...
متن کاملHamiltonian Laceability of Hypercubes with Faults of Charge One
In 2007, in their paper Path coverings with prescribed ends in faulty hypercubes, N. Castañeda and I. Gotchev formulated the following conjecture: Let n and k be positive integers with n ≥ k + 3 and F be a set of k even (odd) and k + 1 odd (even) vertices in the binary hypercube Qn. If u1 and u2 are two distinct even (odd) vertices inQn − F then forQn − F there exists a Hamiltonian path that co...
متن کاملProof of Locke’s Conjecture, I
Locke’s conjecture (L) states that the binary hypercube Qn with k deleted vertices of each parity is Hamiltonian if n ≥ k + 2. In 2003, S. C. Locke and R. Stong published in The American Mathematical Monthly a proof of (L) for the case k = 1. In 2007, in the paper Path coverings with prescribed ends in faulty hypercubes the authors proved (L) for every k ≤ 4 and formulated the following conject...
متن کاملMatchings Extend to Perfect Matchings on Hypercube Networks
In this work, we investigate in the problem of perfect matchings with prescribed matchings in the n-dimensional hypercube network Qn. We obtain the following contributions: For any arbitrary matching with at most n − 1 edges, it can be extended to a perfect matching of Qn for n ≥ 1. Furthermore, for any arbitrary non-forbidden matching with n edges, it also can be extended to a perfect matching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009